package main.leetcode.offer.secondround.from03to50;

/** 47.礼物的最大值 */
public class ex47 {
    /** 动态规划 */
    public int maxValue(int[][] grid) {
        int m = grid.length;
        int n = grid[0].length;
        int[][] dp = new int[m + 1][n + 1];
        for (int i = 1; i <= m; ++i) {
            for (int j = 1; j <= n; ++j) {
                dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]) + grid[i - 1][j - 1];
            }
        }
        return dp[m][n];
    }

    /** 动态规划，状态压缩 */
    //    public int maxValue(int[][] grid) {
    //        int m = grid.length;
    //        int n = grid[0].length;
    //        int[] dp = new int[n + 1];
    //        for (int i = 1; i <= m; ++i) {
    //            for (int j = 1; j <= n; ++j) {
    //                dp[j] = Math.max(dp[j], dp[j - 1]) + grid[i - 1][j - 1];
    //            }
    //        }
    //        return dp[n];
    //    }
}
